Fast blind identification of FIR communications channels
نویسندگان
چکیده
This contribution describes a fast frequency domain approach for blind channel identification which does not rely on the statistic of the symbols. The proposed approach is based on the so–called “intraspectral relations” of DFT’s of PAM fractionally sampled signals. The use of DFT’s is allowed under certain conditions commonly encountered in data communication systems. The intraspectral relations are equivalent to analogous relations introduced in the time domain in [1, 2, 3]. From the intraspectral relations, asymptotically efficient solutions are derived which turn out to be either more accurate or less expensive in term of complexity w.r.t. the time domain counterparts. Simulation results are provided to assess the validity of the proposed approach in comparison with the Rao Cramer bound and with other approaches from the literature.
منابع مشابه
Blind Identification And Equalization For Multiple-input /multiple-output Channels - Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosp
AbstTactTo separa te and recover multiple signals in da t a communications, an tenna a r rays and acoustic sensor arrays, t h e impulse responses of multiple-input/multiple-output (MIMO) channels have t o b e identified explicitly or implicitly. This paper deals with t h e blind identification of MIMO F I R channels based on second-order statistics of t h e channel outpu ts and i ts application...
متن کاملBlind Identification of FIR Systems and Deconvolution of White Input Sequences
This paper deals with the problem of blind identification and deconvolution of FIR channels driven by a white input sequence with unknown variance, in an unbalanced noise environment. By using the structural properties of the covariance matrix of the input, an estimate of the channel coefficients is obtained. The subsequent deconvolution of the unknown input signal is then performed by means of...
متن کاملBlind system identification using minimum noise subspace
Developing fast and robust methods for identifying multiple FIR channels driven by an unknown common source is important for wireless communications, speech reverberation cancellation, and other applications. In this correspondence, we present a new method that exploits a minimum noise subspace (MNS). The MNS is computed from a set of channel output pairs that form a “tree.” The “tree” exploits...
متن کاملNONLINEAR AND NON-GAUSSIAN SIGNAL PROCESSING Exploiting non-Gaussianity in blind identification and equalisation of MIMO FIR channels
The problem of blind identification and equalisation (BIE) of finite impulse response (FIR) channels in multiuser digital communications is investigated. The non-Gaussian nature and statistical independence of the users’ data streams is exploited by resorting to blind signal separation (BSS) based on higher-order statistics (HOS). Two such techniques are put forward. The first technique is comp...
متن کاملBlind identification of FIR channels carrying multiple finite alphabet signals
The finite alphabet property of digital communication signals, along with oversampling techniques, enables the blind identification and equalization of an unknown FIR channel carrying a superposition of such signals, provided they have the same (known) period. Applied to multi-user wireless communications, the same framework allows the blind separation of multiple finite alphabet signals receiv...
متن کامل